0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.33 % Computer : n027.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Jul 13 12:20:55 EDT 2021 0.12/0.33 % CPUTime : 0.12/0.33 % Number of cores: 8 0.12/0.33 % Python version: Python 3.6.8 0.12/0.33 # Version: 2.6rc1-ho 0.12/0.34 # No SInE strategy applied 0.12/0.34 # Trying AutoSched0 for 59 seconds 0.18/0.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S044I 0.18/0.38 # and selection function SelectMaxLComplexNoXTypePred. 0.18/0.38 # 0.18/0.38 # Preprocessing time : 0.031 s 0.18/0.38 # Presaturation interreduction done 0.18/0.38 0.18/0.38 # Proof found! 0.18/0.38 # SZS status Theorem 0.18/0.38 # SZS output start CNFRefutation 0.18/0.38 thf(hoasinduction_lem3a_lthm, axiom, (hoasinduction_lem3a_lthm<=>(axvarid=>(axvarshift=>(hoasinduction_lem3aa=>hoasinduction_lem3a)))), file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax', hoasinduction_lem3a_lthm)). 0.18/0.38 thf(axvarid, axiom, (axvarid<=>![X1:term]:(sub @ X1 @ id)=(X1)), file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax', axvarid)). 0.18/0.38 thf(axvarshift, axiom, (axvarshift<=>(push @ one @ sh)=(id)), file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax', axvarshift)). 0.18/0.38 thf(hoasinduction_lem3aa, axiom, (hoasinduction_lem3aa<=>![X22:subst > term > subst > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X22 @ id @ X1 @ id=>X22 @ id @ (X12 @ id @ X1) @ id)=>X22 @ id @ (hoaslam @ id @ (^[X3:subst, X1:term]:X12 @ X3 @ X1)) @ id))=>![X1:term]:(![X2:term]:(X22 @ id @ X2 @ id=>X22 @ id @ (sub @ X1 @ (push @ X2 @ id)) @ id)=>X22 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id))), file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax', hoasinduction_lem3aa)). 0.18/0.38 thf(hoasinduction_lem3a, axiom, (hoasinduction_lem3a<=>![X25:subst > term > subst > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X25 @ id @ X1 @ id=>X25 @ id @ (X12 @ id @ X1) @ id)=>X25 @ id @ (hoaslam @ id @ (^[X3:subst, X1:term]:X12 @ X3 @ X1)) @ id))=>![X1:term]:(![X2:term]:(X25 @ id @ X2 @ id=>X25 @ id @ (sub @ X1 @ (push @ X2 @ id)) @ id)=>X25 @ id @ (lam @ X1) @ id))), file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax', hoasinduction_lem3a)). 0.18/0.38 thf(thm, conjecture, hoasinduction_lem3a_lthm, file('/export/starexec/sandbox/benchmark/theBenchmark.p', thm)). 0.18/0.38 thf(hoaslam, axiom, (hoaslam)=(^[X3:subst, X12:subst > term > term]:lam @ (X12 @ sh @ one)), file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax', hoaslam)). 0.18/0.38 thf(c_0_7, axiom, (hoasinduction_lem3a_lthm)=((![X1:term]:(sub @ X1 @ id)=(X1)=>((push @ one @ sh)=(id)=>(![X22:subst > term > subst > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X22 @ id @ X1 @ id=>X22 @ id @ (X12 @ id @ X1) @ id)=>X22 @ id @ (hoaslam @ id @ (^[X3:subst, X1:term]:X12 @ X3 @ X1)) @ id))=>![X1:term]:(![X2:term]:(X22 @ id @ X2 @ id=>X22 @ id @ (sub @ X1 @ (push @ X2 @ id)) @ id)=>X22 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id))=>![X25:subst > term > subst > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X25 @ id @ X1 @ id=>X25 @ id @ (X12 @ id @ X1) @ id)=>X25 @ id @ (hoaslam @ id @ (^[X3:subst, X1:term]:X12 @ X3 @ X1)) @ id))=>![X1:term]:(![X2:term]:(X25 @ id @ X2 @ id=>X25 @ id @ (sub @ X1 @ (push @ X2 @ id)) @ id)=>X25 @ id @ (lam @ X1) @ id)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[hoasinduction_lem3a_lthm, axvarid]), axvarshift]), hoasinduction_lem3aa]), hoasinduction_lem3a])). 0.18/0.38 thf(c_0_8, plain, ![X1:term, X3:subst, X12:subst > term > term]:(esk1_3 @ X12 @ X3 @ X1)=(X12 @ X3 @ X1), introduced(definition)). 0.18/0.38 thf(c_0_9, negated_conjecture, ~((![X1:term]:(sub @ X1 @ id)=(X1)=>((push @ one @ sh)=(id)=>(![X22:subst > term > subst > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X22 @ id @ X1 @ id=>X22 @ id @ (X12 @ id @ X1) @ id)=>X22 @ id @ (hoaslam @ id @ (esk1_3 @ X12)) @ id))=>![X1:term]:(![X2:term]:(X22 @ id @ X2 @ id=>X22 @ id @ (sub @ X1 @ (push @ X2 @ id)) @ id)=>X22 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id))=>![X25:subst > term > subst > $o]:(![X12:subst > term > term]:(![X3:subst, X1:term, X4:subst]:(sub @ (X12 @ X3 @ X1) @ X4)=(X12 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=>(![X1:term]:(X25 @ id @ X1 @ id=>X25 @ id @ (X12 @ id @ X1) @ id)=>X25 @ id @ (hoaslam @ id @ (esk1_3 @ X12)) @ id))=>![X1:term]:(![X2:term]:(X25 @ id @ X2 @ id=>X25 @ id @ (sub @ X1 @ (push @ X2 @ id)) @ id)=>X25 @ id @ (lam @ X1) @ id)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_7]), c_0_8]), c_0_8])). 0.18/0.38 thf(c_0_10, plain, ![X3:subst, X12:subst > term > term]:(hoaslam @ X3 @ X12)=(lam @ (X12 @ sh @ one)), inference(fof_simplification,[status(thm)],[hoaslam])). 0.18/0.38 thf(c_0_11, negated_conjecture, ![X335:term, X336:subst > term > subst > $o, X338:subst, X339:term, X340:subst, X341:term, X342:term, X345:subst > term > term, X351:term]:((sub @ X335 @ id)=(X335)&((push @ one @ sh)=(id)&((((X336 @ id @ (esk3_2 @ X336 @ X342) @ id|X336 @ id @ (lam @ (sub @ X342 @ (push @ one @ sh))) @ id|(sub @ (esk2_1 @ X336 @ X338 @ X339) @ X340)=(esk2_1 @ X336 @ (comp @ X338 @ X340) @ (sub @ X339 @ X340)))&(~X336 @ id @ (sub @ X342 @ (push @ (esk3_2 @ X336 @ X342) @ id)) @ id|X336 @ id @ (lam @ (sub @ X342 @ (push @ one @ sh))) @ id|(sub @ (esk2_1 @ X336 @ X338 @ X339) @ X340)=(esk2_1 @ X336 @ (comp @ X338 @ X340) @ (sub @ X339 @ X340))))&(((X336 @ id @ (esk3_2 @ X336 @ X342) @ id|X336 @ id @ (lam @ (sub @ X342 @ (push @ one @ sh))) @ id|(~X336 @ id @ X341 @ id|X336 @ id @ (esk2_1 @ X336 @ id @ X341) @ id))&(~X336 @ id @ (sub @ X342 @ (push @ (esk3_2 @ X336 @ X342) @ id)) @ id|X336 @ id @ (lam @ (sub @ X342 @ (push @ one @ sh))) @ id|(~X336 @ id @ X341 @ id|X336 @ id @ (esk2_1 @ X336 @ id @ X341) @ id)))&((X336 @ id @ (esk3_2 @ X336 @ X342) @ id|X336 @ id @ (lam @ (sub @ X342 @ (push @ one @ sh))) @ id|~X336 @ id @ (hoaslam @ id @ (esk1_3 @ (esk2_1 @ X336))) @ id)&(~X336 @ id @ (sub @ X342 @ (push @ (esk3_2 @ X336 @ X342) @ id)) @ id|X336 @ id @ (lam @ (sub @ X342 @ (push @ one @ sh))) @ id|~X336 @ id @ (hoaslam @ id @ (esk1_3 @ (esk2_1 @ X336))) @ id))))&(((epred1_0 @ id @ (esk7_1 @ X345) @ id|epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X345)) @ id|(sub @ (X345 @ (esk4_1 @ X345) @ (esk5_1 @ X345)) @ (esk6_1 @ X345))!=(X345 @ (comp @ (esk4_1 @ X345) @ (esk6_1 @ X345)) @ (sub @ (esk5_1 @ X345) @ (esk6_1 @ X345))))&(~epred1_0 @ id @ (X345 @ id @ (esk7_1 @ X345)) @ id|epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X345)) @ id|(sub @ (X345 @ (esk4_1 @ X345) @ (esk5_1 @ X345)) @ (esk6_1 @ X345))!=(X345 @ (comp @ (esk4_1 @ X345) @ (esk6_1 @ X345)) @ (sub @ (esk5_1 @ X345) @ (esk6_1 @ X345)))))&((~epred1_0 @ id @ X351 @ id|epred1_0 @ id @ (sub @ esk8_0 @ (push @ X351 @ id)) @ id)&~epred1_0 @ id @ (lam @ esk8_0) @ id))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])). 0.18/0.38 thf(c_0_12, plain, ![X333:subst, X334:subst > term > term]:(hoaslam @ X333 @ X334)=(lam @ (X334 @ sh @ one)), inference(variable_rename,[status(thm)],[c_0_10])). 0.18/0.38 thf(c_0_13, plain, ![X352:term, X353:subst, X354:subst > term > term]:(esk1_3 @ X354 @ X353 @ X352)=(X354 @ X353 @ X352), inference(variable_rename,[status(thm)],[c_0_8])). 0.18/0.38 thf(c_0_14, negated_conjecture, ![X3:subst, X2:term, X14:subst > term > subst > $o, X4:subst, X1:term]:(X14 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id|(sub @ (esk2_1 @ X14 @ X3 @ X2) @ X4)=(esk2_1 @ X14 @ (comp @ X3 @ X4) @ (sub @ X2 @ X4))|~X14 @ id @ (sub @ X1 @ (push @ (esk3_2 @ X14 @ X1) @ id)) @ id), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_15, negated_conjecture, (push @ one @ sh)=(id), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_16, negated_conjecture, ![X1:term]:(sub @ X1 @ id)=(X1), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_17, negated_conjecture, ![X1:term, X14:subst > term > subst > $o, X2:term]:(X14 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id|X14 @ id @ (esk2_1 @ X14 @ id @ X2) @ id|~X14 @ id @ (sub @ X1 @ (push @ (esk3_2 @ X14 @ X1) @ id)) @ id|~X14 @ id @ X2 @ id), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_18, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X12)) @ id|~epred1_0 @ id @ (X12 @ id @ (esk7_1 @ X12)) @ id|(sub @ (X12 @ (esk4_1 @ X12) @ (esk5_1 @ X12)) @ (esk6_1 @ X12))!=(X12 @ (comp @ (esk4_1 @ X12) @ (esk6_1 @ X12)) @ (sub @ (esk5_1 @ X12) @ (esk6_1 @ X12)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_19, plain, ![X3:subst, X12:subst > term > term]:(hoaslam @ X3 @ X12)=(lam @ (X12 @ sh @ one)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.18/0.38 thf(c_0_20, plain, ![X12:subst > term > term, X3:subst, X1:term]:(esk1_3 @ X12 @ X3 @ X1)=(X12 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])). 0.18/0.38 thf(c_0_21, negated_conjecture, ![X1:term, X14:subst > term > subst > $o, X2:term]:(X14 @ id @ (esk3_2 @ X14 @ X1) @ id|X14 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id|X14 @ id @ (esk2_1 @ X14 @ id @ X2) @ id|~X14 @ id @ X2 @ id), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_22, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (esk7_1 @ X12) @ id|epred1_0 @ id @ (hoaslam @ id @ (esk1_3 @ X12)) @ id|(sub @ (X12 @ (esk4_1 @ X12) @ (esk5_1 @ X12)) @ (esk6_1 @ X12))!=(X12 @ (comp @ (esk4_1 @ X12) @ (esk6_1 @ X12)) @ (sub @ (esk5_1 @ X12) @ (esk6_1 @ X12)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_23, negated_conjecture, ![X1:term, X14:subst > term > subst > $o]:(X14 @ id @ (esk3_2 @ X14 @ X1) @ id|X14 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id|~X14 @ id @ (hoaslam @ id @ (esk1_3 @ (esk2_1 @ X14))) @ id), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_24, negated_conjecture, ![X1:term, X3:subst, X14:subst > term > subst > $o, X4:subst, X2:term]:((esk2_1 @ X14 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=(sub @ (esk2_1 @ X14 @ X3 @ X1) @ X4)|X14 @ id @ (lam @ X2) @ id|~X14 @ id @ (sub @ X2 @ (push @ (esk3_2 @ X14 @ X2) @ id)) @ id), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15]), c_0_16])). 0.18/0.38 thf(c_0_25, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (sub @ esk8_0 @ (push @ X1 @ id)) @ id|~epred1_0 @ id @ X1 @ id), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_26, negated_conjecture, ~epred1_0 @ id @ (lam @ esk8_0) @ id, inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_27, negated_conjecture, ![X14:subst > term > subst > $o, X2:term, X1:term]:(X14 @ id @ (esk2_1 @ X14 @ id @ X1) @ id|X14 @ id @ (lam @ X2) @ id|~X14 @ id @ (sub @ X2 @ (push @ (esk3_2 @ X14 @ X2) @ id)) @ id|~X14 @ id @ X1 @ id), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_15]), c_0_16])). 0.18/0.38 thf(c_0_28, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (lam @ (X12 @ sh @ one)) @ id|(X12 @ (comp @ (esk4_1 @ X12) @ (esk6_1 @ X12)) @ (sub @ (esk5_1 @ X12) @ (esk6_1 @ X12)))!=(sub @ (X12 @ (esk4_1 @ X12) @ (esk5_1 @ X12)) @ (esk6_1 @ X12))|~epred1_0 @ id @ (X12 @ id @ (esk7_1 @ X12)) @ id), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_20])). 0.18/0.38 thf(c_0_29, negated_conjecture, ![X14:subst > term > subst > $o, X2:term, X1:term]:(X14 @ id @ (esk2_1 @ X14 @ id @ X1) @ id|X14 @ id @ (esk3_2 @ X14 @ X2) @ id|X14 @ id @ (lam @ X2) @ id|~X14 @ id @ X1 @ id), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_15]), c_0_16])). 0.18/0.38 thf(c_0_30, negated_conjecture, ![X12:subst > term > term]:(epred1_0 @ id @ (lam @ (X12 @ sh @ one)) @ id|epred1_0 @ id @ (esk7_1 @ X12) @ id|(X12 @ (comp @ (esk4_1 @ X12) @ (esk6_1 @ X12)) @ (sub @ (esk5_1 @ X12) @ (esk6_1 @ X12)))!=(sub @ (X12 @ (esk4_1 @ X12) @ (esk5_1 @ X12)) @ (esk6_1 @ X12))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_19]), c_0_20])). 0.18/0.38 thf(c_0_31, negated_conjecture, ![X1:term, X14:subst > term > subst > $o]:(X14 @ id @ (esk3_2 @ X14 @ X1) @ id|X14 @ id @ (lam @ X1) @ id|~X14 @ id @ (lam @ (esk2_1 @ X14 @ sh @ one)) @ id), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_15]), c_0_16]), c_0_19]), c_0_20])). 0.18/0.38 thf(c_0_32, negated_conjecture, ![X1:term, X3:subst, X4:subst]:((esk2_1 @ epred1_0 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=(sub @ (esk2_1 @ epred1_0 @ X3 @ X1) @ X4)|~epred1_0 @ id @ (esk3_2 @ epred1_0 @ esk8_0) @ id), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])). 0.18/0.38 thf(c_0_33, negated_conjecture, ![X1:term, X14:subst > term > subst > $o]:(X14 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id|~X14 @ id @ (sub @ X1 @ (push @ (esk3_2 @ X14 @ X1) @ id)) @ id|~X14 @ id @ (hoaslam @ id @ (esk1_3 @ (esk2_1 @ X14))) @ id), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_34, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (esk2_1 @ epred1_0 @ id @ X1) @ id|~epred1_0 @ id @ (esk3_2 @ epred1_0 @ esk8_0) @ id|~epred1_0 @ id @ X1 @ id), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_25]), c_0_26])). 0.18/0.38 thf(c_0_35, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (esk3_2 @ epred1_0 @ X1) @ id|epred1_0 @ id @ (lam @ X1) @ id|(esk2_1 @ epred1_0 @ (comp @ (esk4_1 @ (esk2_1 @ epred1_0)) @ (esk6_1 @ (esk2_1 @ epred1_0))) @ (sub @ (esk5_1 @ (esk2_1 @ epred1_0)) @ (esk6_1 @ (esk2_1 @ epred1_0))))!=(sub @ (esk2_1 @ epred1_0 @ (esk4_1 @ (esk2_1 @ epred1_0)) @ (esk5_1 @ (esk2_1 @ epred1_0))) @ (esk6_1 @ (esk2_1 @ epred1_0)))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31])). 0.18/0.38 thf(c_0_36, negated_conjecture, ![X1:term, X4:subst, X3:subst, X2:term]:((esk2_1 @ epred1_0 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=(sub @ (esk2_1 @ epred1_0 @ X3 @ X1) @ X4)|epred1_0 @ id @ (esk2_1 @ epred1_0 @ id @ X2) @ id|~epred1_0 @ id @ X2 @ id), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_29]), c_0_26])). 0.18/0.38 thf(c_0_37, negated_conjecture, ![X1:term, X14:subst > term > subst > $o]:(X14 @ id @ (lam @ X1) @ id|~X14 @ id @ (sub @ X1 @ (push @ (esk3_2 @ X14 @ X1) @ id)) @ id|~X14 @ id @ (lam @ (esk2_1 @ X14 @ sh @ one)) @ id), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_15]), c_0_16]), c_0_19]), c_0_20])). 0.18/0.38 thf(c_0_38, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (esk2_1 @ epred1_0 @ id @ X1) @ id|~epred1_0 @ id @ X1 @ id), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_26]), c_0_36])). 0.18/0.38 thf(c_0_39, negated_conjecture, (~epred1_0 @ id @ (lam @ (esk2_1 @ epred1_0 @ sh @ one)) @ id|~epred1_0 @ id @ (esk3_2 @ epred1_0 @ esk8_0) @ id), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_25]), c_0_26])). 0.18/0.38 thf(c_0_40, negated_conjecture, (epred1_0 @ id @ (lam @ (esk2_1 @ epred1_0 @ sh @ one)) @ id|(esk2_1 @ epred1_0 @ (comp @ (esk4_1 @ (esk2_1 @ epred1_0)) @ (esk6_1 @ (esk2_1 @ epred1_0))) @ (sub @ (esk5_1 @ (esk2_1 @ epred1_0)) @ (esk6_1 @ (esk2_1 @ epred1_0))))!=(sub @ (esk2_1 @ epred1_0 @ (esk4_1 @ (esk2_1 @ epred1_0)) @ (esk5_1 @ (esk2_1 @ epred1_0))) @ (esk6_1 @ (esk2_1 @ epred1_0)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_38]), c_0_30])). 0.18/0.38 thf(c_0_41, negated_conjecture, ![X1:term, X2:term, X3:subst, X14:subst > term > subst > $o, X4:subst]:(X14 @ id @ (esk3_2 @ X14 @ X1) @ id|X14 @ id @ (lam @ (sub @ X1 @ (push @ one @ sh))) @ id|(sub @ (esk2_1 @ X14 @ X3 @ X2) @ X4)=(esk2_1 @ X14 @ (comp @ X3 @ X4) @ (sub @ X2 @ X4))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.38 thf(c_0_42, negated_conjecture, ~epred1_0 @ id @ (esk3_2 @ epred1_0 @ esk8_0) @ id, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_32])). 0.18/0.38 thf(c_0_43, negated_conjecture, ![X1:term, X3:subst, X14:subst > term > subst > $o, X4:subst, X2:term]:((esk2_1 @ X14 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=(sub @ (esk2_1 @ X14 @ X3 @ X1) @ X4)|X14 @ id @ (esk3_2 @ X14 @ X2) @ id|X14 @ id @ (lam @ X2) @ id), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_15]), c_0_16])). 0.18/0.38 thf(c_0_44, negated_conjecture, ![X1:term, X3:subst, X4:subst]:(esk2_1 @ epred1_0 @ (comp @ X3 @ X4) @ (sub @ X1 @ X4))=(sub @ (esk2_1 @ epred1_0 @ X3 @ X1) @ X4), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_26])). 0.18/0.38 thf(c_0_45, negated_conjecture, ![X1:term]:(epred1_0 @ id @ (esk3_2 @ epred1_0 @ X1) @ id|epred1_0 @ id @ (lam @ X1) @ id), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_44])])). 0.18/0.38 thf(c_0_46, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_45]), c_0_26]), ['proof']). 0.18/0.38 # SZS output end CNFRefutation 0.18/0.38 # Proof object total steps : 47 0.18/0.38 # Proof object clause steps : 33 0.18/0.38 # Proof object formula steps : 14 0.18/0.38 # Proof object conjectures : 34 0.18/0.38 # Proof object clause conjectures : 31 0.18/0.38 # Proof object formula conjectures : 3 0.18/0.38 # Proof object initial clauses used : 14 0.18/0.38 # Proof object initial formulas used : 7 0.18/0.38 # Proof object generating inferences : 10 0.18/0.38 # Proof object simplifying inferences : 34 0.18/0.38 # Training examples: 0 positive, 0 negative 0.18/0.38 # Parsed axioms : 238 0.18/0.38 # Removed by relevancy pruning/SinE : 0 0.18/0.38 # Initial clauses : 139 0.18/0.38 # Removed in clause preprocessing : 124 0.18/0.38 # Initial clauses in saturation : 15 0.18/0.38 # Processed clauses : 81 0.18/0.38 # ...of these trivial : 1 0.18/0.38 # ...subsumed : 24 0.18/0.38 # ...remaining for further processing : 56 0.18/0.38 # Other redundant clauses eliminated : 0 0.18/0.38 # Clauses deleted for lack of memory : 0 0.18/0.38 # Backward-subsumed : 4 0.18/0.38 # Backward-rewritten : 4 0.18/0.38 # Generated clauses : 113 0.18/0.38 # ...of the previous two non-trivial : 102 0.18/0.38 # Contextual simplify-reflections : 5 0.18/0.38 # Paramodulations : 89 0.18/0.38 # Factorizations : 0 0.18/0.38 # NegExts : 0 0.18/0.38 # Equation resolutions : 0 0.18/0.38 # Propositional unsat checks : 0 0.18/0.38 # Propositional check models : 0 0.18/0.38 # Propositional check unsatisfiable : 0 0.18/0.38 # Propositional clauses : 0 0.18/0.38 # Propositional clauses after purity: 0 0.18/0.38 # Propositional unsat core size : 0 0.18/0.38 # Propositional preprocessing time : 0.000 0.18/0.38 # Propositional encoding time : 0.000 0.18/0.38 # Propositional solver time : 0.000 0.18/0.38 # Success case prop preproc time : 0.000 0.18/0.38 # Success case prop encoding time : 0.000 0.18/0.38 # Success case prop solver time : 0.000 0.18/0.38 # Current number of processed clauses : 33 0.18/0.38 # Positive orientable unit clauses : 12 0.18/0.38 # Positive unorientable unit clauses: 6 0.18/0.38 # Negative unit clauses : 2 0.18/0.38 # Non-unit-clauses : 13 0.18/0.38 # Current number of unprocessed clauses: 48 0.18/0.38 # ...number of literals in the above : 179 0.18/0.38 # Current number of archived formulas : 0 0.18/0.38 # Current number of archived clauses : 23 0.18/0.38 # Clause-clause subsumption calls (NU) : 51 0.18/0.38 # Rec. Clause-clause subsumption calls : 34 0.18/0.38 # Non-unit clause-clause subsumptions : 11 0.18/0.38 # Unit Clause-clause subsumption calls : 103 0.18/0.38 # Rewrite failures with RHS unbound : 98 0.18/0.38 # BW rewrite match attempts : 63 0.18/0.38 # BW rewrite match successes : 12 0.18/0.38 # Condensation attempts : 0 0.18/0.38 # Condensation successes : 0 0.18/0.38 # Termbank termtop insertions : 19012 0.18/0.38 0.18/0.38 # ------------------------------------------------- 0.18/0.38 # User time : 0.037 s 0.18/0.38 # System time : 0.008 s 0.18/0.38 # Total time : 0.045 s 0.18/0.38 # Maximum resident set size: 2004 pages 0.18/0.38 EOF